Memory Efficient Mutual Information-Maximizing Quantized Min-Sum Decoding for Rate-Compatible LDPC Codes

نویسندگان

چکیده

In this letter, we propose a two-stage design method to construct memory efficient mutual information-maximizing quantized min-sum (MIM-QMS) decoder for rate-compatible low-density parity-check (LDPC) codes. We first develop modified density evolution unique set of lookup tables (LUTs) that can be used LDPC The constructed LUTs are optimized based on their discrepancy values and merge function reduce the requirement. Numerical results show proposed MIM-QMS requirement decoding by up 94.92 % compared benchmark LUT-based with generally faster convergence speed. addition, approach performance floating-pointing belief propagation within 0.15 dB.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rate-Compatible LDPC Codes

We present a new class of irregular low-density parity-check (LDPC) codes for moderate block lengths (up to a few thousand bits) that are well-suited for rate-compatible puncturing. The proposed codes show good performance under puncturing over a wide range of rates and are suitable for usage in incremental redundancy hybrid-automatic repeat request (ARQ) systems. In addition, these codes are l...

متن کامل

Area-Efficient Min-Sum Decoder Design for High-Rate QC-LDPC Codes in Magnetic Recording

This paper presents a silicon area efficient quasicyclic (QC) low-density parity-check (LDPC) code decoder design solution, which is geared to magnetic recording that demands high code rate and very high decoding throughput under stringent silicon cost constraint. The key of this proposed design solution is to transform the conventional formulation of the MinSum decoding algorithm in such a way...

متن کامل

LDPC Code Design for Min-Sum Based Decoding

We consider the problem of designing low-density parity-check (LDPC) codes for min-sum decoding. We wish to find the LDPC ensemble with the best asymptotic performance. In [1], [2], Amraoui and Urbanke proposed an optimization scheme where a combination of density evolution and extrinsic information transfer (EXIT) charts is used to design LDPC codes for the belief propagation decoding algorith...

متن کامل

QC LDPC Codes for MIMO and Cooperative Networks using Two Way Normalized Min-Sum Decoding

This paper is based on the magnitude overestimation correction of the variable message by using two normalized factors in each iteration for LDPC min-sum decoding algorithm. The variable message is modified with a normalized factor when there is a sign change and with another normalized factor when there is no sign change during any two consecutive iterations. This paper incorporates QC LDPC co...

متن کامل

A Modified Normalized Min - Sum Decoding Algorithm for Irregular LDPC Codes

ABSTRACT In this paper, a modified normalized Min-Sum algorithm (MNMSA) is proposed for decoding irregular Low Density Parity Check Codes (LDPC) with non-uniform degree distribution. The proposed algorithm provides an efficient decoding scheme to enhance the error performance of an irregular LDPC code without increasing the hardware complexity. An efficient 6 bit quantization scheme is utilized...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Communications Letters

سال: 2022

ISSN: ['1558-2558', '1089-7798', '2373-7891']

DOI: https://doi.org/10.1109/lcomm.2022.3144309